New Continuous-Time Formulation and Algorithm for Crude-Oil Scheduling Problems with Oil Residency Time Constraint and Pipeline Transportation

نویسندگان

  • Yuming Zhao
  • Han Chen
چکیده

The optimal scheduling of crude-oil operation in refineries has been studied by various groups during the past decade, leading to different mixed integer linear programming or mixed nonlinear programming formulations. This paper proposes a new MINLP formulation with an oil residency time constraint and common pipeline transportation that is based on single-operation sequencing (SOS). An effective choice strategy for priority-slot number is presented. This model is also developed upon the representation of a crude-oil scheduling by a single sequence of transportation operations. A method is proposed to solve this model which can get optimal solution with the smallest priority-slot number if it exists.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Crude Oil Short-Term Scheduling Algorithm with Multiple Charging Tanks Charging a Distiller Overlapingly Based on Priority-Slot Continuous-Time Formulation

The optimal scheduling of crude-oil operation in refineries has been researched by various groups during the past decade. Different mixed integer linear programming or mixed nonlinear programming formulations are derived. This paper proposes a novel MINLP formulation with multiple charging tanks charging a distiller overlapingly and oil residency time constraint that is based on multi-operation...

متن کامل

Priority-Slot-Based Continuous-Time MINLP Formulation for Crude-Oil Scheduling Problem with Two-Pipeline Transportation

Some oil refineries arrange low-fusion-point crude oil storage tanks and ones containing high-fusionpoint crude oil at two diverse locations. Refinery needs different pipeline to transport different fusion point oil, so, to transport diverse fusion point oil it needs two pipelines. Because of the constraints resulted from transporting high-fusion-point oil, to schedule such a system is very har...

متن کامل

Short-term Scheduling of Refinery Operations Based on a Continuous Time Formulation

The problem addressed in this work is to develop a comprehensive mathematical programming model for the efficient scheduling of oil-refinery operations. Our approach is first to decompose the overall problem spatially into three domains: the crude-oil unloading and blending, the production-unit operations and the product blending and delivery. In particular, the first problem involves the crude...

متن کامل

An Improved Optimization Model for Scheduling of a Multi-Product Tree-Like Pipeline

In the petroleum supply chain, oil refined products are often delivered to distribution centers by pipelines since they provide the most reliable and economical mode of transportation over large distances. This paper addresses the optimal scheduling of a complex pipeline network with multiple branching lines. The main challenge is to find the optimal sequence and time of product injections/deli...

متن کامل

A Novel Priority-Slot Based Continuous-Time Formulation for Crude-Oil Scheduling Problems

The optimal scheduling of crude-oil operations in refineries has been studied by various groups during the past decade leading to different mixed integer linear programming (MILP) or mixed integer nonlinear programming (MINLP) formulations. This paper presents a new continuous-time formulation, called single-operation sequencing (SOS) model, which can be used to solve the crude-oil operations p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015